Equitable Block Colourings for Systems of 4-Kites
نویسندگان
چکیده
An equitable colouring of a balanced G-design (X,B) is a map φ∶B → C such that ∣bi(x) − bj(x)∣ ≤ 1 for any x ∈ X and i, j, with i ≠ j, being bi(x) the number of blocks containing the vertex x and coloured with the colour i. A c-colouring is a colouring in which exactly c colours are used. A c-colouring of type s is a colourings in which, for every vertex x, all the blocks containing x are coloured exactly with s colours. A bicolouring, tricolouring or quadricolouring is an equitable colouring with s = 2, s = 3 or s = 4. In this paper we consider systems of graphs consisting of a 4-cycle and a pendant edge. We call such a graph a 4-kite and we consider balanced 4-kite systems. In particular, we prove that c-bicolourings of balanced 4-kite systems exist if and only if c = 2,3. Mathematics Subject Classification: 05C15
منابع مشابه
Equitable colourings in the Witt designs
There is a vast literature already in existence on colourings in graphs and designs. We refer the interested reader to [2, 7, 8, 11, 12]. A major application of such colourings is to sampling and scheduling problems. For an excellent consideration of designs for statistical purposes, see [13]; in [8], examples of graph colouring applications in scheduling are described. Let P be a point set and...
متن کامل2 PAOLA BONACINI AND LUCIA MARINO The
Let Σ = (X,B) a 4-cycle system of order v = 1 + 8k. A c-colouring of type s is a map φ∶ B → C, with C set of colours, such that exactly c colours are used and for every vertex x all the blocks containing x are coloured exactly with s colours. Let 4k = qs+r, with q, r ≥ 0. φ is equitable if for every vertex x the set of the 4k blocks containing x is parted in r colour classes of cardinality q + ...
متن کاملOn colourings of Steiner triple systems
A Steiner triple system, STS(v), is said to be χ-chromatic if the points can be coloured using χ colours, but no fewer, such that no block is monochromatic. All known 3-chromatic STS(v) are also equitably colourable, i.e. there exists a 3-colouring in which the cardinalities of the colour classes differ by at most one. We present examples of 3-chromatic STS(v) which do not admit equitable 3-col...
متن کاملEquitable block colourings for 8-cycle systems
Let Σ = (X,B) be an 8-cycle system of order v = 1+16k. A c-colouring of type s is a map φ : B → C, with C set of colours, so that exactly c colours are used and for every vertex x all the blocks containing x are coloured with exactly s colours. Let 8k = qs+ r, with q, r ≥ 0. The colouring φ is called equitable if for every vertex x the set of the 8k blocks containing x is partitioned into r col...
متن کاملEquitable Colourings Of D-Degenerate Graphs
In many applications of graph colouring the sizes of colour classes should not be too large. For example, in scheduling jobs (some of which could be performed at the same time), it is not good if the resulting schedule requires many jobs to occur at some specific time. An application of this type is discussed in [8]. A possible formalization of this restriction is the notion of equitable colour...
متن کامل